Proof theory of higher-order equations: conservativity, normal forms and term rewriting
نویسندگان
چکیده
منابع مشابه
Proof theory of higher-order equations: conservativity, normal forms and term rewriting
We introduce a necessary and sufficient condition for the ω-extensionality rule of higherorder equational logic to be conservative over first-order many-sorted equational logic for ground first-order equations. This gives a precise condition under which computation in the higher-order initial model by term rewriting is possible. The condition is then generalised to characterise a normal form fo...
متن کاملHigher-Order Orderings for Normal Rewriting
We extend the termination proof methods based on reduction orderings to higher-order rewriting systems using higher-order pattern matching, and accomodate for any use of eta, as a reduction, as an expansion or as an equation.
متن کاملUnique Normal Form Property of Higher-Order Rewriting Systems
Within the framework of Higher-Order Rewriting Systems proposed by van Oostrom, a su cient condition for the unique normal form property is presented. This requires neither left-linearity nor termination of the system.
متن کاملComplexity Hierarchies and Higher-order Cons-free Term Rewriting
Constructor rewriting systems are said to be cons-free if, roughly, constructor terms in the right-hand sides of rules are subterms of the left-hand sides; the computational intuition is that rules cannot build new data structures. In programming language research, cons-free languages have been used to characterize hierarchies of computational complexity classes; in term rewriting, cons-free fi...
متن کاملHigher-Order Rewriting
Note: This paper will appear in the proceedings of the 10th international conference on rewriting techniques and applications (RTA'99). c Springer Verlag.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2003
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(03)00048-5